Ordered Structures and Projections
نویسندگان
چکیده
منابع مشابه
Ordered Structures and Projections
We associate a covering relation to the usual order relation defined in the set of all idempotent endomorphisms projections of a finite-dimensional vector space. A characterization is given of it. This characterization makes this order an order verifying the Jordan-Dedekind chain condition. We give also a property for certain finite families of this order. More precisely, the family of parts in...
متن کاملOrdered Structures and Computability Ordered Structures and Computability Dedication
We consider three questions surrounding computable structures and orderings. First, we make progress toward answering a question of Downey, Hirschfeldt, and Goncharov by showing that for a large class of countable linear orderings, the Turing degree spectrum of the successor relation is closed upward in the c.e. degrees. Next we consider computable partial orders (specifically, finitely branchi...
متن کاملFinding representative patterns with ordered projections
This paper presents a new approach to 2nding representative patterns for dataset editing. The algorithm patterns by ordered projections (POP), has some interesting characteristics: important reduction of the number of instances from the dataset; lower computational cost ( (mn log n)) with respect to other typical algorithms due to the absence of distance calculations; conservation of the decisi...
متن کاملOrdered Topological Structures
The paper discusses interactions between order and topology on a given set which do not presuppose any separation conditions for either of the two structures, but which lead to the existing notions established by Nachbin in more special situations. We pursue this discussion at the much more general level of lax algebras, so that our categories do not concern just ordered topological spaces, but...
متن کاملSearching Ordered Structures
Suppose distinct real numbers are assigned to the elements of a finite partially ordered set P in an order preserving manner. The problem of determining the fewest numbers of comparisons required to locate a given number x in P is investigated. Some general bounds are provided for the problem and analyzed in detail for the case that P is a product of chains and that P is a rooted forest. t19x5 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2008
ISSN: 0161-1712,1687-0425
DOI: 10.1155/2008/783041